DCT/DST and Gauss-Markov fields: conditions for equivalence
نویسندگان
چکیده
The correspondence addresses the intriguing question of which random models are equivalent to the discrete cosine transform (DCT) and discrete sine transform (DST). Common knowledge states that these transforms are asymptotically equivalent to first-order Gauss causal Markov random processes. We establish that the DCT and the DST are exactly equivalent to homogeneous one-dimensional (1-D) and two-dimensional (2–D) Gauss noncausal Markov random fields defined on finite lattices with appropriate boundary conditions.
منابع مشابه
Telescoping Recursive Representations and Estimation of Gauss-Markov Random Fields
We present telescoping recursive representations for both continuous and discrete indexed noncausal Gauss-Markov random fields. Our recursions start at the boundary (for example, a hypersurface in R, d ≥ 1) and telescope inwards. Under appropriate conditions, the recursions for the random field are differential/difference representations driven by white noise, for which we can use standard recu...
متن کامل- II . 5 - 1 - Invariant Spaces and Cosine Transforms DCT - 2 and DCT - 6
Abstract: In paper two types of the discrete cosine (and sine) transforms (DCT/DST) are analyzed. These transforms are useful for many applications. It is shown that if an operator, connected with the Discrete Fourier Transform (DFT), is referred to an appropriate basis it takes block-diagonal form. These blocks coincide with DCT-2/DST-2 for even dimensions of the signals’ space and with DCT6/D...
متن کاملRadix-2 Algorithms for Implementation of Type-II Discrete Cosine Transform and Discrete Sine Transform
In this paper radix-2 algorithms for computation of type-II discrete cosine transform (DCT) and discrete sine transform (DST) of length N = 2 (n ≥ 2) are presented. The DCT/DST can be computed from two DCT/DST sequences, each of length N/2. The odd-indexed output components of DCT/DST can be realized using simple recursive relations. The proposed algorithms require a reduced number of arithmeti...
متن کاملA Uni ed Systolic Array for Fast Computation of the DCT/DST/DHT
This paper proposes a two-dimensional (2-D) VLSI architecture using a uni ed systolic array for fast computation of the discrete cosine transform/discrete sine transform/discrete Hartley transform (DCT/DST/DHT). The N -point discrete transform is decomposed into evenand oddnumbered frequency samples and they are computed independently at the same time. The proposed uni ed systolic array archite...
متن کاملFast Computing of Discrete Cosine and Sine Transforms of Types VI and VII
The Discrete Sine and Cosine Transforms (DST and DCT) have already received considerable attention due to their use in source coding. The DCT of type-II (DCT-II) is at the core of standards for image and video compression, such as JPEG, H.26x-series, and MPEG 1-4 standards. The DST of type-I was suggested as a basis for Recursive Block Coding technique. The DCT and DST of type IV are used in de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Signal Processing
دوره 46 شماره
صفحات -
تاریخ انتشار 1998